/* -*- Mode: C; indent-tabs-mode: t; c-basic-offset: 4; tab-width: 4 -*- */
/*
 * onefactorizations
 * Copyright (C)  2010 <>
 * 
 * onefactorizations is free software: you can redistribute it and/or modify it
 * under the terms of the GNU General Public License as published by the
 * Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 * 
 * onefactorizations is distributed in the hope that it will be useful, but
 * WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
 * See the GNU General Public License for more details.
 * 
 * You should have received a copy of the GNU General Public License along
 * with this program.  If not, see <http://www.gnu.org/licenses/>.
 */

#ifndef _CLEAR_ITERATOR_H_
#define _CLEAR_ITERATOR_H_

#include "boostDefs.h"
#include <iostream>

class ClearIterator
{
public:
   ClearIterator(bedge_iterator edge_iter, bedge_iterator end, int remove1, int remove2, const BoostGraph* const g);
   ClearIterator(ClearIterator const &other);
   ~ClearIterator();

   std::pair<int,int> operator*();
   // Prefix increment
   ClearIterator& operator++();
   // Postfix increment
   ClearIterator operator++(int);
   bool operator==(const ClearIterator& other);
   bool operator!=(const ClearIterator& other);

protected:

private:
   int vremove1,vremove2;
   bedge_iterator iter;
   bedge_iterator end_iter;
   const BoostGraph* graph;
};

#endif // _CLEAR_ITERATOR_H_
